A COMPLEX MIX-SHIFTED PARALLEL QR ALGORITHM FOR THE C-METHOD

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Complex Mix-Shifted Parallel QR Algorithm for the C-Method

The C-method is an exact method for analyzing gratings and rough surfaces. This method leads to large-size dense complex non-Hermitian eigenvalue. In this paper, we introduce a parallel QR algorithm that is specifically designed for the C-method. We define the “early shift” for the matrix according to the observed properties. We propose a combination of the “early shift”, Wilkinson’s shift and ...

متن کامل

Linear Convergence in the Shifted Qr Algorithm

Global and asymptotic convergence properties for the QR algorithm with Francis double shift are established for certain orthogonal similarity classes of 4 x 4 real matrices. It is shown that in each of the classes every unreduced Hessenberg matrix will decouple and that the rate of decoupling is almost always linear. The effect of the EISPACK exceptional shift strategy is shown to be negligible.

متن کامل

Convergence of the shifted QR algorithm for unitary Hessenberg matrices

This paper shows that for unitary Hessenberg matrices the QR algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with glob...

متن کامل

A parallel implementation of the QR-algorithm

In this paper a parallel implementation of the QR algorithm for the eigenvalues of a non-Hermitian matrix is proposed. The algorithm is designed to run eeciently on a linear array of processors that communicate by accessing their neighbors' memory. A module for building such arrays, the Maryland crab, is also described.

متن کامل

Parallel QR algorithm for data-driven decompositions

Many fluid flows of engineering applications, although very complex in appearance, can be approximated by lower-order models governed by a few modes, able to capture the dominant behavior (dynamics) of the system. Recently, different techniques have been developed, designed to extract the most dominant coherent structures from the flow. Some of the more general techniques are based on data-driv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Progress In Electromagnetics Research B

سال: 2016

ISSN: 1937-6472

DOI: 10.2528/pierb16040806